Gate-level Synthesis of Boolean Functions using Information Theory Concepts
نویسندگان
چکیده
In this paper we apply information theory concepts to evolutionary Boolean circuit synthesis. We discuss the schema destruction problem when simple conditional entropy is used as fitness function. The design problem is the synthesis of Boolean functions by using the minimum number of binary multiplexers. We show that the fitness landscape of normalized mutual information exhibits better characteristics for evolutionary search than the landscape of simple mutual information. A comparison of minimum evolved circuits shows the potential of information theory concepts.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملBoolean Decomposition in Combinational Logic Synthesis
Today’s digital designs have reached a magnitude making it intractable for humans to develop designs on a gate level. Large designs are developed with help of hardware description languages like VHDL, or with other methods using high level of abstraction. Computer based synthesis tools are applied to transfer those descriptions to layouts for implementation in programmable circuits like Field P...
متن کاملA Set Theory Based Factoring Technique and Its Use for Low Power Logic Design
Factoring Boolean functions is one of the basic operations in algorithmic logic synthesis. A novel algebraic factorization heuristic for single-output combinatorial logic functions is presented in this paper and is developed based on the set theory paradigm. The impact of factoring is analyzed mainly from a low power design perspective for standard cell based digital designs in this paper. The ...
متن کاملBased FPGA Synthesis for Multi - Output Boolean Functions
| One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f = (f 1 ; : : : ; f m ) : f0; 1g n ! f0; 1g m have to deal with is nding sublogic which can be shared by di erent outputs, i.e., nding boolean functions = ( 1 ; : : : ; h ) : f0; 1g p ! f0; 1g h which can be used as common sublogic of good realizations of f 1 ; : : : ; f m . In this paper we...
متن کاملThe Complexity of AND-Decomposition of Boolean Formulas
Decomposition of boolean functions is an important research topic having a long history and a wide range of applications in the logic circuit synthesis, (hyper)graph/game theory, and combinatorial optimization. AND-decomposition means representing a boolean function as a conjunction of two (or several) functions sharing a given subset of variables. If the shared subset is empty, the decompositi...
متن کامل